Lower bounds for fractional Laplacian eigenvalues

LOWER BOUNDS FOR EIGENVALUES OF THE ONE-DIMENSIONAL p-LAPLACIAN

We also prove that the lower bound is sharp. Eigenvalue problems for quasilinear operators of p-Laplace type like (1.1) have received considerable attention in the last years (see, e.g., [1, 2, 3, 5, 8, 13]). The asymptotic behavior of eigenvalues was obtained in [6, 7]. Lyapunov inequalities have proved to be useful tools in the study of qualitative nature of solutions of ordinary linear diffe...

Bounds for Laplacian Graph Eigenvalues

Let G be a connected simple graph whose Laplacian eigenvalues are 0 = μn (G) μn−1 (G) · · · μ1 (G) . In this paper, we establish some upper and lower bounds for the algebraic connectivity and the largest Laplacian eigenvalue of G . Mathematics subject classification (2010): 05C50, 15A18.

Majorization bounds for signless Laplacian eigenvalues

Guaranteed lower bounds for eigenvalues

This paper introduces fully computable two-sided bounds on the eigenvalues of the Laplace operator on arbitrarily coarse meshes based on some approximation of the corresponding eigenfunction in the nonconforming Crouzeix-Raviart finite element space plus some postprocessing. The efficiency of the guaranteed error bounds involves the global mesh-size and is proven for the large class of graded m...

Bounds on normalized Laplacian eigenvalues of graphs

*Correspondence: [email protected] 1School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian, P.R. China 2Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, P.R. China Full list of author information is available at the end of the article Abstract Let G be a simple connected graph of order n, where n≥ 2. Its normalized Laplacian eigenvalues are 0 = λ1 ...